Model-Checking First-Order Logic: Automata and Locality
نویسنده
چکیده
منابع مشابه
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. This approach is extended to h...
متن کاملFree Grammars and Languages
Floyd’s Operator Precedence languages (OPLs) were originally introduced to support deterministic parsing of programming languages [11]; then, interest in them decayed for several decades, probably due to the advent of more expressive grammars, such as LR ones which also allow for efficient deterministic parsing. Recently, however, we renewed our interest in this family of languages on the basis...
متن کاملCoping With Strong Fairness On-the- y Emptiness Checking for Streett Automata
The model checking approach to veriication has proven to be very successful. Stating the required properties in temporal logic allows the process of veriication to be automated. When propositional linear temporal logic (LTL) is used as the speciication language BBchi automata usually are the theoretical constructions of choice. BBchi automata, however, cannot cope with strong fairness eeciently...
متن کاملAutomatic Structures and Their Complexity Bakhadyr Khoussainov and Mia Minnes
In recent years there has been increasing interest in the study of structures that can be presented by automata. The underlying idea in this line of research consists of applying properties of automata and techniques of automata theory to decision problems that arise in logic and applications. A typical example of a decision problem is the model checking problem, stated as follows. For a struct...
متن کاملModel Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification and temporal operators. In this paper we study Quantified Computation Tree Logic (QCTL), which extends the well-known p...
متن کامل